Minimality Concepts Using a New Parameterized Binary Relation in Vector Optimization
نویسنده
چکیده
A new parameterized binary relation is used to define minimality concepts in vector optimization. To simplify the problem of determining minimal elements the method of scalarization is applied. Necessary and sufficient conditions for the existence of minimal elements with respect to the scalarized problems are given. The multiplier rule of Lagrange is generalized. As a necessary minimality condition a Karush-KuhnTucker-condition is obtained. The results are applied to optimization problems in finite-dimensional vector spaces. Mathematics Subject Classification: 47N10, 49N10, 65K10
منابع مشابه
BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملHarmonicity and Minimality of Vector Fields on Lorentzian Lie Groups
We consider four-dimensional lie groups equipped with left-invariant Lorentzian Einstein metrics, and determine the harmonicity properties of vector fields on these spaces. In some cases, all these vector fields are critical points for the energy functional restricted to vector fields. We also classify vector fields defining harmonic maps, and calculate explicitly the energy of t...
متن کاملSufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones
In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...
متن کاملPrediction of true critical temperature and pressure of binary hydrocarbon mixtures: A Comparison between the artificial neural networks and the support vector machine
Two main objectives have been considered in this paper: providing a good model to predict the critical temperature and pressure of binary hydrocarbon mixtures, and comparing the efficiency of the artificial neural network algorithms and the support vector regression as two commonly used soft computing methods. In order to have a fair comparison and to achieve the highest efficiency, a comprehen...
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کامل